Variable neighborhood search for maximum diverse grouping problem
نویسندگان
چکیده
منابع مشابه
Variable Neighborhood Search for Maximum Diverse Grouping Problem
This paper presents a general variable neighborhood search (GVNS) heuristic for solving the maximum diverse grouping problem. Extensive computational experiments performed on a series of large random graphs as well as on several instances of the maximum diversity problem taken from the literature show that the results obtained by GVNS consistently outperform the best heuristics from the literat...
متن کاملVariable neighborhood search for the maximum clique
Maximum clique is one of the most studied NP-hard optimization problem on graphs because of its simplicity and its numerous applications. A basic variable neighborhood search heuristic for maximum clique that combines greedy with the simplicial vertex test in its descent step is proposed and tested on standard test problems from the literature. Despite its simplicity, the proposed heuristic out...
متن کاملIterated maxima search for the maximally diverse grouping problem
The maximally diverse grouping problem (MDGP) is to partition the vertices of an edge-weighted and undirected complete graph into m groups such that the total weight of the groups is maximized subject to some group size constraints. MDGP is a NP-hard combinatorial problem with a number of relevant applications. In this paper, we present an innovative heuristic algorithm called iterated maxima s...
متن کاملMulti-neighborhood tabu search for the maximum weight clique problem
Given an undirected graph G = (V,E) with vertex set V = {1, ..., n} and edge set E ⊆ V × V . Let w : V → Z be a weighting function that assigns to each vertex i ∈ V a positive integer. The maximum weight clique problem (MWCP) is to determine a clique of maximum weight. This paper introduces a tabu search heuristic whose key features include a combined neighborhood and a dedicated tabu mechanism...
متن کاملLarge Neighborhood Local Search for the Maximum Set Packing Problem
In this paper we consider the classical maximum set packing problem where set cardinality is upper bounded by k. We show how to design a variant of a polynomial-time local search algorithm with performance guarantee (k + 2)/3. This local search algorithm is a special case of a more general procedure that allows to swap up to Θ(log n) elements per iteration. We also design problem instances with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2014
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor121223003u